Canonical correlation analysis based on information theory

In this article, we propose a new canonical correlation method based on information theory. This method examines potential nonlinear relationships between p×1 vector Y-set and q×1 vector X-set. It finds canonical coefficient vectors a and b by maximizing a more general measure, the mutual information, between a^TX and b^TY. We use a permutation test to determine the pairs of the new canonical correlation variates, which requires no specific distributions for X and Y as long as one can estimate the densities of a^TX and b^TY nonparametrically. Examples illustrating the new method are presented.     

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

PS_N is a fast forward permutation if for each m the computational complexity of evaluating P^m(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in S_N is Θ(N) if one does not use queries of the form P^m(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form P^m(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold.     

Rook theory and cycle-counting permutation statistics

A statistic is found to combinatorially generate the cycle-counting q-hit numbers, defined algebraically by Haglund [Adv. in Appl. Math. 17 (1996) 408–459]. We then define the notion of a cycle-Mahonian pair of statistics (generalizing that of a Mahonian statistic), and show that our newly discovered statistic is part of such a pair. Finally, we note a second example of a cycle-Mahonian pair of statistics which leads us to define the stronger property of being a cycle-Euler–Mahonian pair.     

Weber Correspondence Analysis: The One-Dimensional Case

When designing programs or software for the implementation of Monte Carlo (MC) hypothesis tests, we can save computation time by using sequential stopping boundaries. Such boundaries imply stopping resampling after relatively few replications if the early replications indicate a very large or a very small p value. We study a truncated sequential probability ratio test (SPRT) boundary and provide a tractable algorithm to implement it. We review two properties desired of any MC p value, the validity of the p value and a small resampling risk, where resampling risk is the probability that the accept/reject decision will be different than the decision from complete enumeration. We show how the algorithm can be used to calculate a valid p value and confidence intervals for any truncated SPRT boundary. We show that a class of SPRT boundaries is minimax with respect to resampling risk and recommend a truncated version of boundaries in that class by comparing their resampling risk (RR) to the RR of fixed boundaries with the same maximum resample size. We study the lack of validity of some simple estimators of p values and offer a new, simple valid p value for the recommended truncated SPRT boundary. We explore the use of these methods in a practical example and provide the MChtest R package to perform the methods.     

Permutation trinomials over Fq3

We consider four classes of polynomials over the fields ${\mathbb{F}}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+A{x}^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+A{x}^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+A{x}^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+A{x}^q-Bx$, where $A,B\in {\mathbb{F}}_q$. We find sufficient conditions on the pairs $(A,B)$ for which these polynomials permute ${\mathbb{F}}_{q^3}$ and we give lower bounds on the number of such pairs.     

Characterizing and Generating Bivariate Empirical Rank Distributions Satisfying Certain Positive Dependence Concepts

Abstract

This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class S_N of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of S_N that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of S_N. For example, the class of positively quadrant dependent permutations in S_N is characterized in this fashion.     

A new color image cryptosystem via hyperchaos synchronization

This paper proposes a novel color image cryptosystem based on synchronization of two different six-dimensional hyperchaotic systems. In the transmitter end, we apply the drive system to generate the diffusion matrices and scrambling ones, which are used to change the image pixel value and position, respectively. Thus the ciphered image is obtained. In the receiver, synchronization of two nonidentical hyperchaotic systems can be achieved by designing the appropriate controllers. The response system is employed to yield the corresponding diffusion matrices and scrambling ones using the same generation method in the encryption algorithm. Then the cipher-image can be decrypted by the decryption algorithm, which is similar to that of the encryption process but in the reversed order. The experimental results show that the presented image cryptosystem has high security and can resist noise and crop attacks.